The fast discrete Radon transform. I. Theory - Image Processing, IEEE Transactions on

نویسنده

  • Vijay K. Madisetti
چکیده

A new inversion scheme for reconstruction of images from projections based upon the slope-intercept form of the discrete Radon transform is presented. A seminal algorithm for the forward and the inverse transforms was proposed by Beylkin in 1987. However, as proposed, the original algorithm demonstrated poor dispersion characteristics for steep slopes and could not invert transforms based upon nonlinear slope variations. By formulating the computation as a discrete computation of the continuous Radon transform formula, we explicitly derive fast new generalized inversion methods that overcome the original shortcomings. The generalized forward (FRT) and inverse algorithm (IFRT) proposed are fast, eliminate interpolation calculations, and convert directly between a raster scan grid and a rectangular/polar grid in one step. Part I1 of this paper describes the implementation of the algorithm on a massively parallel computer, and a new time-domain formulation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast curve estimation using preconditioned generalized Radon transform

A new algorithm for fast curve parameter estimation based on the generalized Radon transform is proposed. The algorithm works on binary images, obtained, e.g., by edge filtering or deconvolution. The fundamental idea of the suggested algorithm is the use of a precondition map to reduce the computational cost of the generalized Radon transform. The precondition map is composed of irregular regio...

متن کامل

Two-dimensional matched filtering for motion estimation

In this work, we describe a frequency domain technique for the estimation of multiple superimposed motions in an image sequence. The least-squares optimum approach involves the computation of the three-dimensional (3-D) Fourier transform of the sequence, followed by the detection of one or more planes in this domain with high energy concentration. We present a more efficient algorithm, based on...

متن کامل

The finite ridgelet transform for image representation

The ridgelet transform was introduced as a sparse expansion for functions on continuous spaces that are smooth away from discontinuities along lines. We propose an orthonormal version of the ridgelet transform for discrete and finite-size images. Our construction uses the finite Radon transform (FRAT) as a building block. To overcome the periodization effect of a finite transform, we introduce ...

متن کامل

On-board selection of relevant images: an application to linear feature recognition

We propose an on-board selection scheme for aerial and space images, based on linear feature detection in a feature hyperspace. The detection task is performed by means of the Radon transform (RT) and the wavelet transform; a fast algorithm for the RT computation is described, and counteractions against the discretization errors are proposed. A new, wavelet-based algorithm is introduced, which ...

متن کامل

Reply to "Comments on 'The discrete periodic radon transform'"

Each set of numbers , as shown, is the splitting signal , where . The summation of values of the image in is performed by points such that . If we change by and by , and denote the even number by , we obtain the following: . The set of numbers , is the splitting-signal written in the second line in the tensor transform in (5). Thus, in the case, the DPRT repeated the concept of the tensor trans...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004